The football pool problem for 7 and 8 matches
نویسندگان
چکیده
منابع مشابه
The Football Pool Problem for 7 and 8 Matches
Let k3(n) denote the minimal cardinality of a ternary code of length n and covering radius one. In this paper we show k3(7) ≥ 156 and k3(8) ≥ 402 improving on the best previously known bounds k3(7) ≥ 153 and k3(8) ≥ 398. The proofs are founded on a recent technique of the author for dealing with systems of linear inequalities satisfied by the number of elements of a covering code, that lie in k...
متن کاملNew upper bounds for the football pool problem for 6, 7, and 8 matches
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...
متن کاملA New Lower Bound for the Football Pool Problem for Six Matches
© Université Bordeaux 1, 1996, tous droits réservés. L’accès aux archives de la revue « Journal de Théorie des Nombres de Bordeaux » (http://jtnb.cedram.org/) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier do...
متن کاملThe Inverse Football Pool Problem
The minimal number of spheres (without “interior”) of radius n required to cover the finite set {0, . . . , q−1} equipped with the Hamming distance is denoted by T (n, q). The only hitherto known values of T (n, q) are T (n, 3) for n = 1, . . . , 6. These were all given in the 1950s in the Finnish football pool magazine Veikkaaja along with upper and lower bounds for T (n, 3) for n ≥ 7. Recentl...
متن کاملA new lower bound for the football pool problem for 7 matchespar
A new lower bound for the football pool problem for 7 matches par Laurent HABSIEGER 1 R esum e. Notons K 3 (7; 1) le cardinal minimal d'un code ternaire de longueur 7 et de rayon de recouvrement un. Dans un pr ec edent article, nous avons am elior e la minoration K 3 (7; 1) 147 en montrant que K 3 (7; 1) 150. Dans cette note, nous prouvons que K 3 (7; 1) 153. Abstract. Let K 3 (7; 1) denote the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1983
ISSN: 0097-3165
DOI: 10.1016/0097-3165(83)90033-x